Constructions for Higher Dimensional Perfect Multifactors
نویسنده
چکیده
Perfect maps, factors and multifactors can be viewed as higher dimensional analogues of de Bruijn cycles and factored versions of these cycles. We present a unified framework for two basic techniques, concatenation and integration (also called the inverse of Lempel’s homomorphism), used to construct perfect multifactors. This framework simplifies proofs of known results and allows for extension of the basic constructions. In particular, we give the first general results on the inverse of Lempel’s homomorphism in dimensions three and higher.
منابع مشابه
Array Orthogonality in Higher Dimensions
We generalize the array orthogonality property for perfect autocorrelation sequences to n-dimensional arrays. The generalized array orthogonality property is used to derive a number of ndimensional perfect array constructions.
متن کاملOn a Generalized Aperiodic Perfect Map
An aperiodic perfect map(APM) is an array with the property that every array of certain size, called a window, arises exactly once as a contiguous subarray in the array. In this article, we deal with the generalization of APM in higher dimensional arrays. First, we reframe all known definitions onto the generalized n-dimensional arrays. Next, some elementary known results on arrays are generali...
متن کاملPerfect binary arrays and difference sets
A perfect binary array is an r-dimensional array with elements k 1 such that all out-of-phase periodic autocorrelation coefficients are zero. Such an array is equivalent to a Menon difference set in an abelian group. We give recursive constructions for four infinite families of two-dimensional perfect binary arrays, using only elementary methods. Brief outlines of the proofs were previously giv...
متن کاملDecoding Perfect Maps
Perfect Maps are two-dimensional arrays in which every possible sub-array of a certain size occurs exactly once. They are a generalisation of the de Bruijn sequences to two dimensions and are of practical significance in certain position location applications. In such applications the decoding problem, i.e. resolving the position of a particular sub-array within a specified Perfect Map, is of g...
متن کاملNew Constructions for Perfect Hash Families andRelated Structures using Combinatorial
In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...
متن کامل